Multi-agent Optimal Path Planning for Mobile Robots in Environment with Obstacles
نویسندگان
چکیده
The paper describes a problem of multi-agent path planning in environment with obstacles. Novel approach to multi-agent optimal path planning, using graph representation of environment models is described. When planning the path of each robot, the graph model of environment is dynamically changed for path correction and collision avoidance. New algorithm applies changes of robots’ paths and speeds to avoid collisions in multi-agent environment.
منابع مشابه
Optimal Trajectory Planning of a Mobile Robot with Spatial Manipulator For Spatial Obstacle Avoidance
Mobile robots that consist of a mobile platform with one or many manipulators mounted on it are of great interest in a number of applications. Combination of platform and manipulator causes robot operates in extended work space. The analysis of these systems includes kinematics redundancy that makes more complicated problem. However, it gives more feasibility to robotic systems because of the e...
متن کاملPSO-Based Path Planning Algorithm for Humanoid Robots Considering Safety
In this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses Ferguson splines and PSO (Particle Swarm Optimization). The objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. Ferguson splines create preliminary paths using random generated para...
متن کاملGeodesic Problems for Mobile Robots
As mobile robots operate with limited resources which they carry onboard in large obstructed environments, their success is dependent on how efficiently they move while they avoid collision with obstacles and other robots. Moving optimally is the ultimate efficiency a mobile robot can achieve. Therefore, planning optimal motions and devising optimal coordination strategies are two important and...
متن کاملFormation Control and Path Planning of Two Robots for Tracking a Moving Target
This paper addresses the dynamic path planning for two mobile robots in unknownenvironment with obstacle avoidance and moving target tracking. These robots must form atriangle with moving target. The algorithm is composed of two parts. The first part of thealgorithm used for formation planning of the robots and a moving target. It generates thedesired position for the robots for the next step. ...
متن کاملCoverage Path Planning Using Mobile Robot Team Formations
The multi-robot coverage path-planning problem involves finding collision-free paths for a set of robots so that they can completely cover the surface of an environment. This problem is non-trivial as the geometry and location of obstacles in the environment is usually not known a priori by the robots, and they have to adapt their coverage path as they discover obstacles while moving in the env...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999